#include <stdio.h>
#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#include <list>

#define sf(x) scanf("%d", &x)
#define pf(x) printf("%d ", x)
#define pf2(x,y) printf("%d %d ", x,y)
#define sf2(x,y) scanf("%d %d", &x,&y)
#define sff(x) scanf("%lf", &x)
#define pff(x) printf("%lf ", x)
#define ENDL printf("\n")
#define pfl(x) printf("%I64d ", x)
#define sfl(x) scanf("%I64d", &x)



using namespace std;


typedef long long ll;

int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);
	string s;
	cin>>s;
	while(s!="#")
	{
		
		ll a=0,b=1;
		for(int i=0; i<s.size();)
		{
			if(s[i]=='n')
			{
				
				if(i==0)
				{
					a=0;
					b=1;
				}
				else
				{
					a*=2;
					b*=2;
					a-=90;
					if(a<0) a=0;
				}
				i+=5;
			}
			else if(s[i]=='w')
			{
				
				if(i==0)
				{
					a=90;
					b=1;
				}
				else
				{
					a*=2;
					b*=2;
					a+=90;
					if(a>90*b) a=90*b;
				}
				i+=4;
			}
		}
		while(a%2==0&&b>1&&a!=0)
		{
			a/=2;
			b/=2;
		}
		if(a==0||b ==1)
		{
			printf("%I64d\n",a);
		}
		else
		{
			printf("%I64d/%I64d\n",a,b);
		}
		cin>>s;
	}
	return 0;
}




